Optimization of Moodle for Adaptive Testing
نویسندگان
چکیده
منابع مشابه
Adaptive Learning Using Moodle And Handheld Devices
Today, handheld devices in addition to efficiently perform the function for which they were created are also facilitators of all kinds of content through its integrated internet connectivity. The user can access and play multimedia information (pictures, videos, music, podcast, ...), read news, ... and complete educational activities. Regarding the role of learning facilitator, the challenge is...
متن کاملoptimization of progeny testing programs for iranian holstein dairy cattle
a deterministic model was employed to simulate various progeny testing programs compatible with the conditions of holstein dairy cattle population in iran. in simulated programs, the selection intensity of bulls was increased by increasing the ratio of cow population in mate with young bulls. selection accuracy in the programs was fixed because of the fixed progeny group. economic efficiency (t...
متن کاملAdaptive Encoding for Optimization
This report describes a general method for rendering search coordinate system independent, Adaptive Encoding (AE). Adaptive Encoding is applicable to any continuous domain search algorithm and includes (incremental) changes of the coordinate system, that is, changes of the representation of solutions. One attractive way to change the representation within AE is derived from the Covariance Matri...
متن کاملAdaptivity in Moodle beyond the Limits of Adaptivity in Moodle
Learning management systems (LMS, for short) have meanwhile gained an enormous practical relevance. Nevertheless, the quality of service offered is, at least in some respect, astonishingly behind the state of the art. Adaptivity of system behavior is such a field in which we confine ourselves to much less than we can afford. The authors develop an original approach, demonstrate an implementatio...
متن کاملAdaptive Bound Optimization for Online Convex Optimization
We introduce a new online convex optimization algorithm that adaptively chooses its regularization function based on the loss functions observed so far. This is in contrast to previous algorithms that use a fixed regularization function such as L2-squared, and modify it only via a single time-dependent parameter. Our algorithm’s regret bounds are worst-case optimal, and for certain realistic cl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: DEStech Transactions on Computer Science and Engineering
سال: 2017
ISSN: 2475-8841
DOI: 10.12783/dtcse/cmsam2017/16420